Spread-out percolation
نویسندگان
چکیده
Fix d ≥ 2, and let X be either Z or the points of a Poisson process in R of intensity 1. Given parameters r and p, join each pair of points of X within distance r independently with probability p. This is the simplest case of a ‘spread-out’ percolation model studied by Penrose [8], who showed that, as r → ∞, the average degree of the corresponding random graph at the percolation threshold tends to 1, i.e., the percolation threshold and the threshold for criticality of the naturally associated branching process approach one another. Here we show that this result follows immediately from of a general result of [3] on inhomogeneous random graphs.
منابع مشابه
Continuum Percolation with Unreliable and Spread-Out Connections
We derive percolation results in the continuum plane that lead to what appears to be a general tendency of many stochastic network models. Namely, when the selection mechanism according to which nodes are connected to each other, is sufficiently spread out, then a lower density of nodes, or on average fewer connections per node, are sufficient to obtain an unbounded connected component. We look...
متن کاملCritical two-point functions and the lace expansion for spread-out high-dimensional percolation and related models
We consider spread-out models of self-avoiding walk, bond percolation, lattice trees and bond lattice animals on Zd, having long finite-range connections, above their upper critical dimensions d = 4 (self-avoiding walk), d = 6 (percolation) and d = 8 (trees and animals). The two-point functions for these models are respectively the generating function for selfavoiding walks from the origin to x...
متن کاملCritical Two-point Functions and the Lace Expansion for Spread-out High-dimensional Percolation and Related Models by Takashi Hara,1 Remco
We consider spread-out models of self-avoiding walk, bond percolation, lattice trees and bond lattice animals on Zd , having long finite-range connections, above their upper critical dimensions d = 4 (self-avoiding walk), d = 6 (percolation) and d = 8 (trees and animals). The two-point functions for these models are respectively the generating function for selfavoiding walks from the origin to ...
متن کاملSpread-out percolation in R
Fix d ≥ 2, and let X be either Z or the points of a Poisson process in R of intensity 1. Given parameters r and p, join each pair of points of X within distance r independently with probability p. This is the simplest case of a ‘spread-out’ percolation model studied by Penrose [8], who showed that, as r →∞, the average degree of the corresponding random graph at the percolation threshold tends ...
متن کاملEpidemics, disorder, and percolation
Spatial models for spread of an epidemic may be mapped onto bond percolation. We point out that with disorder in the strength of contacts between individuals patchiness in the spread of the epidemic is very likely, and the criterion for epidemic outbreak depends strongly on the disorder because the critical region of the corresponding percolation model is broadened. In some networks the percola...
متن کامل